Does Adiabatic Quantum Optimization Fail for NP-Complete Problems?
نویسندگان
چکیده
منابع مشابه
Adiabatic quantum optimization fails for random instances of NP-complete problems
Abstract Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed hard instances where adiabatic optimization requires exponential time. In spite of this, there was still hope that this would not happen for random i...
متن کاملAnderson localization makes adiabatic quantum optimization fail.
Understanding NP-complete problems is a central topic in computer science (NP stands for nondeterministic polynomial time). This is why adiabatic quantum optimization has attracted so much attention, as it provided a new approach to tackle NP-complete problems using a quantum computer. The efficiency of this approach is limited by small spectral gaps between the ground and excited states of the...
متن کاملAdiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [6]) has flexible parameters. We show that by choosing the parameters appropriately in the problem Hamiltonian (without changing the problem to be solved) for MIS on CK graphs [7], we can prevent the first order quan...
متن کاملDifferent adiabatic quantum optimization algorithms for the NP-complete exact cover problem.
One of the most important questions in studying quantum computation is: whether a quantum computer can solve NP-complete problems more efficiently than a classical computer? In 2000, Farhi, et al. (Science, 292(5516):472–476, 2001) proposed the adiabatic quantum optimization (AQO), a paradigm that directly attacks NP-hard optimization problems. How powerful is AQO? Early on, van Dam and Vaziran...
متن کاملScalable Architecture for Adiabatic Quantum Computing of Np-hard Problems
We present a comprehensive review of past research into adiabatic quantum computation and then propose a scalable architecture for an adiabatic quantum computer that can treat NP-hard problems without requiring local coherent operations. Instead, computation can be performed entirely by adiabatically varying a magnetic field applied to all the qubits simultaneously. Local (incoherent) operation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2011
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.106.050502